Scalable Internet Routing on Topology-Independent Node Identities

نویسنده

  • Bryan Ford
چکیده

Unmanaged Internet Protocol (UIP) is a fully selforganizing network-layer protocol that implements scalable identity-based routing. In contrast with addressbased routing protocols, which depend for scalability on centralized hierarchical address management, UIP nodes use a flat namespace of cryptographic node identifiers. Node identities can be created locally on demand and remain stable across network changes. Unlike locationindependent name services, the UIP routing protocol can stitch together many conventional address-based networks with disjoint or discontinuous address domains, providing connectivity between any pair of participating nodes even when no underlying network provides direct connectivity. The UIP routing protocol works on networks with arbitrary topologies and global traffic patterns, and requires only O(log N) storage per node for routing state, enabling even small, ubiquitous edge devices to act as ad-hoc selfconfiguring routers. The protocol rapidly recovers from network partitions, bringing every node up-to-date in a multicast-based chain reaction of O(log N) depth. Simulation results indicate that UIP finds routes that are on average within 2× the length of the best possible route. This technical report describes a work in progress and does not contain complete, final, or polished results. This research was conducted as part of the IRIS project (http://project-iris.net/), supported by the National Science Foundation under Cooperative Agreement No. ANI-0225660.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TAC: A Topology-Aware Chord-based Peer-to-Peer Network

Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...

متن کامل

A Topology-Aware Relay Lookup Scheme for P2P VoIP System

Because of the best-effort service in Internet, direct routing path of Internet may not always meet the VoIP quality requirements. Thus, many researches proposed Peer-to-Peer VoIP systems such as SIP+P2P system, which uses relay node to relay RTP stream from the source node to the destination node and uses application-layer routing scheme to lookup the best relay nodes. The key of those systems...

متن کامل

Reduced State Routing in the Internet

In today’s Internet core, routers store forwarding state proportional to the number of edge networks. As the Internet grows and core line rates increase, routers require memories that are increasingly fast and large—and are correspondingly increasingly expensive and difficult to engineer. In this paper, we present Reduced-State Routing (RSR), in which core routers require state only concerning ...

متن کامل

A new scalable modeling framework and scalable parallel

in thinking about dynamic behavior of data networks. Classical teletraffic theory has yielded to empiricism, as detailed traffic measurements reveal self-similar correlations of aggregate traffic and multifractal scaling behavior.1-4 Empirical routing analyses have found ubiquitous route instabilities across many time scales that subvert static network topology concepts. 5 This research is very...

متن کامل

HDLBR: A name-independent compact routing scheme for power-law networks

Compact routing intends to achieve a good tradeoff between routing path length and storage overhead, and is recently considered as a main alternative to overcome the fundamental scaling limitations of the Internet routing system. It is generally believed that specialized compact routing schemes for peculiar network topologies have better average performance than universal ones, and name-indepen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003